A Bijection for Essentially 4-Connected Toroidal Triangulations
نویسندگان
چکیده
منابع مشابه
A bijection for essentially 4-connected toroidal triangulations
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications (drawing algorithm, random generation, enumeration. . . ). In this paper we introduce and study a generalization of these objects for the toroidal case. Contrary to...
متن کاملA bijection for triangulations, quadrangulations, pentagulations, etc
A d-angulation is a planar map with faces of degree d. We present for each integer d ≥ 3 a bijection between the class of d-angulations of girth d and a class of decorated plane trees. Each of the bijections is obtained by specializing a “master bijection” which extends an earlier construction of the first author. Bijections already existed for triangulations (d = 3) and for quadrangulations (d...
متن کامل4-connected Triangulations and 4-orderedness
For a positive integer k ≥ 4, a graph G is called k-ordered, if for any ordered set of k distinct vertices of G, G has a cycle that contains all the vertices in the designated order. Goddard [3] showed that every 4-connected triangulation of the plane is 4-ordered. In this paper, we improve this result; every 4-connected triangulation of any surface is 4-ordered. Our proof is much shorter than ...
متن کاملMaking triangulations 4-connected using flips
We show that any triangulation on n vertices can be transformed into a 4connected one using at most b(3n−7)/5c edge flips. We also give an example of a triangulation that requires d(3n− 10)/5e flips to be made 4-connected, showing that our bound is tight. In addition, we improve the upper bound on the number of flips required to transform any 4-connected triangulation into the canonical triangu...
متن کاملEncoding toroidal triangulations
Poulalhon and Schaeffer introduced an elegant method to linearly encode a planar triangulation optimally. The method is based on performing a special depth-first search algorithm on a particular orientation of the triangulation: the minimal Schnyder wood. Recent progress toward generalizing Schnyder woods to higher genus enables us to generalize this method to the toroidal case. In the plane, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2019
ISSN: 1077-8926
DOI: 10.37236/7897